package com.zk.algorithm.linkedlist;

import com.zk.algorithm.bean.ListNode;

/**
 * @author zk
 */
public class ReorderList {

    // Given a singly linked list L: L0→L1→…→Ln-1→Ln,
    // reorder it to: L0→Ln→L1→Ln-1→L2→Ln-2→…
    //
    // 1 -> 2 -> 3 -> 4 -> 5
    // 1 -> 5 -> 2 -> 4 -> 3
    public void reorderList(ListNode head) {
        // 借助一个栈
    }

}
